全文获取类型
收费全文 | 790篇 |
免费 | 319篇 |
国内免费 | 64篇 |
出版年
2024年 | 1篇 |
2023年 | 18篇 |
2022年 | 10篇 |
2021年 | 21篇 |
2020年 | 36篇 |
2019年 | 19篇 |
2018年 | 13篇 |
2017年 | 62篇 |
2016年 | 65篇 |
2015年 | 48篇 |
2014年 | 70篇 |
2013年 | 58篇 |
2012年 | 79篇 |
2011年 | 59篇 |
2010年 | 42篇 |
2009年 | 86篇 |
2008年 | 58篇 |
2007年 | 65篇 |
2006年 | 63篇 |
2005年 | 42篇 |
2004年 | 44篇 |
2003年 | 33篇 |
2002年 | 36篇 |
2001年 | 23篇 |
2000年 | 20篇 |
1999年 | 18篇 |
1998年 | 14篇 |
1997年 | 14篇 |
1996年 | 11篇 |
1995年 | 10篇 |
1994年 | 8篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 8篇 |
1989年 | 4篇 |
排序方式: 共有1173条查询结果,搜索用时 15 毫秒
31.
32.
网络图式军用文书是战时通用装备保障文书中通常采用的文书形式之一,给出装备保障文书辅助生成系统的总体结构,将网络分析方法引入通用装备保障文书辅助生成系统的研究,在此基础上阐述了网络图式文书生成子系统的功能、数学模型及网络计算、网络优化的部分算法。 相似文献
33.
A genetic algorithm with neighborhood search for the resource‐constrained project scheduling problem
The resource‐constrained project scheduling problem (RCPSP) consists of a set of non‐preemptive activities that follow precedence relationship and consume resources. Under the limited amount of the resources, the objective of RCPSP is to find a schedule of the activities to minimize the project makespan. This article presents a new genetic algorithm (GA) by incorporating a local search strategy in GA operators. The local search strategy improves the efficiency of searching the solution space while keeping the randomness of the GA approach. Extensive numerical experiments show that the proposed GA with neighborhood search works well regarding solution quality and computational time compared with existing algorithms in the RCPSP literature, especially for the instances with a large number of activities. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
34.
35.
A. Garnaev 《海军后勤学研究》2007,54(1):109-114
This paper deals with a two searchers game and it investigates the problem of how the possibility of finding a hidden object simultaneously by players influences their behavior. Namely, we consider the following two‐sided allocation non‐zero‐sum game on an integer interval [1,n]. Two teams (Player 1 and 2) want to find an immobile object (say, a treasure) hidden at one of n points. Each point i ∈ [1,n] is characterized by a detection parameter λi (μi) for Player 1 (Player 2) such that pi(1 ? exp(?λixi)) (pi(1 ? exp(?μiyi))) is the probability that Player 1 (Player 2) discovers the hidden object with amount of search effort xi (yi) applied at point i where pi ∈ (0,1) is the probability that the object is hidden at point i. Player 1 (Player 2) undertakes the search by allocating the total amount of effort X(Y). The payoff for Player 1 (Player 2) is 1 if he detects the object but his opponent does not. If both players detect the object they can share it proportionally and even can pay some share to an umpire who takes care that the players do not cheat each other, namely Player 1 gets q1 and Player 2 gets q2 where q1 + q2 ≤ 1. The Nash equilibrium of this game is found and numerical examples are given. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
36.
In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006 相似文献
37.
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
38.
MUSIC方法是空间谱估计中经典的子空间方法。提出了一种构造参考信号的预处理模型,提出了一种适合于MUSIC方法的多级维纳滤波结构。新方法避免了采样数据二阶统计的特征值分解,降低了运算量。仿真结果证明了方法的有效性。 相似文献
39.
40.